Locality optimization for parent Hamiltonians of tensor networks
نویسندگان
چکیده
Tensor Network states form a powerful framework for both the analytical and numerical study of strongly correlated phases. Vital to their utility is that they appear as exact ground associated parent Hamiltonians, where canonical proof techniques guarantee controlled space structure. Yet, while those Hamiltonians are local by construction, known often yield complex which act on rather large number spins. In this paper, we present an algorithm systematically simplify breaking them down into any given basis elementary interaction terms. The underlying optimization problem semidefinite program, thus optimal solution can be found efficiently. Our method exploits degree freedom in construction -- excitation spectrum terms over it optimizes such obtain best possible approximation. We benchmark our AKLT model Toric Code model, show (acting 3 or 4 12 sites, respectively) broken 2-body 4-body then apply paradigmatic Resonating Valence Bond (RVB) kagome lattice. Here, simplest previously Hamiltonian acts all spins one star. With algorithm, vastly simpler Hamiltonian: find RVB state whose products at most four Heisenberg interactions, range further constrained, providing major improvement 12-body Hamiltonian.
منابع مشابه
Memory-Constrained Data Locality Optimization for Tensor Contractions
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions over large multidimensional arrays. Efficient computation of these contractions usually requires the generation of temporary intermediate arrays. These intermediates could be extremely large, requiring their storage on disk. However, the intermediates can often be gene...
متن کاملLocality bounds on hamiltonians for stabilizer codes
In this paper, we study the complexity of Hamiltonians whose groundstate is a stabilizer code. We introduce various notions of k-locality of a stabilizer code, inherited from the associated stabilizer group. A choice of generators leads to a Hamiltonian with the code in its groundspace. We establish bounds on the locality of any other Hamiltonian whose groundspace contains such a code, whether ...
متن کاملOptimization problems in contracted tensor networks
We discuss the calculus of variations in tensor representations with a special focus on tensor networks and apply it to functionals of practical interest. The survey provides all necessary ingredients for applying minimization methods in a general setting. The important cases of target functionals which are linear and quadratic with respect to the tensor product are discussed, and combinations ...
متن کاملLocality Optimization for Program Instances
The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...
متن کاملLocality Optimization for Program Instances
The degree of locality of a program reeects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs by reducing the communication costs. A possible human approach to locality optimization is to consider several small program instances of a given program, nd optimal or close to optimal mappings of data and computations for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2022
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physrevb.106.035109